Symmetric Key Encryption for Arbitrary Block Sizes from Affine Spaces
نویسنده
چکیده
A symmetric key encryption scheme is described for blocks of general size N that is a product of powers of many prime numbers. This is accomplished by realising each number (representing a message unit) as a point in a product of affine spaces over various finite fields. Then algebro-geometric transformations on those spaces is transported back to provide encryption. For a specific block size < 2 128 we get more than 2 5478 keys.
منابع مشابه
A Survey on Advanced Encryption Standard
Rijndael’s Advanced Encryption Standard (AES) is the block cipher based symmetric-key cryptography to protect the sensitive information. The key sizes of AES are 128, 192, 256 bits. AES is based on substitution-permutation strategy. It is accepted by NIST in 2001 after the five year of security evaluation. It is highly secured and efficient than Data Encryption Standard (DES) and other symmetri...
متن کاملA Novel Generic Session Based Bit Level Encryption Technique to Enhance Information Security
In this paper a session based symmetric key encryption system has been proposed and is termed as Permutated Cipher Technique (PCT). This technique is more fast, suitable and secure for larger files. In this technique the input file is broken down into blocks of various sizes (of 2^n order) and encrypted by shifting the position of each bit by a certain value for a certain number of times. A key...
متن کاملFunctional Correctness Proofs of Encryption Algorithms
We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an implementation of higher order logic. For each algorithm, functional correctness, namely that decryption inverts encryption, is formally proved by a simple but effective proof methodology involving application of invertibility lemmas...
متن کاملOptimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages
This paper considers arbitrary-length chosen-ciphertext secure asymmetric encryption, thus addressing what is actually needed for a practical usage of strong public-key cryptography in the real world. We put forward two generic constructions, gem-1 and gem-2, which apply to explicit fixed-length weakly secure primitives and provide a strongly secure (IND-CCA2) public-key encryption scheme for m...
متن کاملRealization of locally extended affine Lie algebras of type $A_1$
Locally extended affine Lie algebras were introduced by Morita and Yoshii in [J. Algebra 301(1) (2006), 59-81] as a natural generalization of extended affine Lie algebras. After that, various generalizations of these Lie algebras have been investigated by others. It is known that a locally extended affine Lie algebra can be recovered from its centerless core, i.e., the ideal generated by weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1612.07574 شماره
صفحات -
تاریخ انتشار 2016